An Improvement of Genetic Algorithms by Search Space Reductions in Solving Large-scale Flowshop Problems
نویسندگان
چکیده
منابع مشابه
An Improvement of Genetic Algorithms by Search Space Reductions in Solving Large-scale Flowshop Problems
While searching for suboptimal solutions for large-scale problems, it is critical to force search algorithms on promising regions. This paper presents genetic algorithms with search space reductions (RGAs) and their application to solving large-scale permutation flowshop problems. The reduced search spaces are defined by adding precedence constraints generated by heuristic rules. To balance bet...
متن کاملSolving Timetabling Problems by Hybridizing Genetic Algorithms and Tabu Search
As demand for Education increases and diversifies, so does the difficulty of designing workable timetables for schools and academic institutions. Besides the intractability of the basic problem, there is an increasing variety of constraints that come into play. In this paper we present a hybrid of two metaheuristics (genetic algorithm and tabu search) to tackle the problem in its most general s...
متن کاملOn Improving the Capacity of Solving Large-scale Wireless Network Design Problems by Genetic Algorithms
Over the last decade, wireless networks have experienced an impressive growth and now play a main role in many telecommunications systems. As a consequence, scarce radio resources, such as frequencies, became congested and the need for effective and efficient assignment methods arose. In this work, we present a Genetic Algorithm for solving large instances of the Power, Frequency and Modulation...
متن کاملGenetic Algorithms for Large-Scale Clustering Problems
We consider the clustering problem in a case where the distances of elements are metric and both the number of attributes and the number of the clusters are large. Genetic algorithm approach gives in this environment high quality clusterings at the cost of long running time. Three new efficient crossover techniques are introduced. The hybridization of genetic algorithm and k-means algorithm is ...
متن کاملA Set of Algorithms for Solving the Generalized Tardiness Flowshop Problems
This paper considers the problem of scheduling n jobs in the generalized tardiness flow shop problem with m machines. Seven algorithms are developed for finding a schedule with minimum total tardiness of jobs in the generalized flow shop problem. Two simple rules, the shortest processing time (SPT), and the earliest due date (EDD) sequencing rules, are modified and employed as the core of seque...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEJ Transactions on Electronics, Information and Systems
سال: 2001
ISSN: 0385-4221,1348-8155
DOI: 10.1541/ieejeiss1987.121.6_1010